翻訳と辞書
Words near each other
・ Winnie-the-Pooh (1969 film)
・ Winnie-the-Pooh (book)
・ Winnie-the-Pooh (disambiguation)
・ Winnie-the-Pooh and a Busy Day
・ Winnie-the-Pooh Pays a Visit
・ Winnifred
・ Winnifred Eaton
・ Winnifred Eaton (missionary)
・ Winnifred Eaton (writer)
・ Winnifred Harper Cooley
・ Winnifred Paskall
・ Winnifred Quick
・ Winnifred Sarah Train
・ Winner, Minnesota
・ Winner, South Dakota
Winner-take-all (computing)
・ Winner-take-all in action selection
・ Winner-Take-All Politics
・ Winnerath
・ Winners
・ Winners & Losers
・ Winners & Losers (season 1)
・ Winners & Losers (season 2)
・ Winners & Losers (season 3)
・ Winners & Losers (season 4)
・ Winners (Bobby Darin album)
・ Winners (Brothers Johnson album)
・ Winners (collection)
・ Winners (film)
・ Winners (Kleeer album)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Winner-take-all (computing) : ウィキペディア英語版
Winner-take-all (computing)

Winner-take-all is a computational principle applied in computational models of neural networks by which neurons in a layer compete with each other for activation. In the classical form, only the neuron with the highest activation stays active while all other neurons shut down, however other variations that allow more than one neuron to be active do exist, for example the soft winner take-all, by which a power function is applied to the neurons.
==Neural networks==
In the theory of artificial neural networks, winner-take-all networks are a case of competitive learning in recurrent neural networks. Output nodes in the network mutually inhibit each other, while simultaneously activating themselves through reflexive connections. After some time, only one node in the output layer will be active, namely the one corresponding to the strongest input. Thus the network uses nonlinear inhibition to pick out the largest of a set of inputs. Winner-take-all is a general computational primitive that can be implemented using different types of neural network models, including both continuous-time and spiking networks (Grossberg, 1973; Oster et al. 2009).
Winner-take-all networks are commonly used in computational models of the brain, particularly for distributed decision-making or action selection in the cortex. Important examples include hierarchical models of vision (Riesenhuber et al. 1999), and models of selective attention and recognition (Carpenter and Grossberg, 1987; Itti et al. 1998). They are also common in artificial neural networks and neuromorphic analog VLSI circuits. It has been formally proven that the winner-take-all operation is computationally powerful compared to other nonlinear operations, such as thresholding (Maass 2000).
In many practical cases, there is not only a single neuron which becomes the only active one but there are exactly ''k'' neurons which become active for a fixed number ''k''. This principle is referred to as k-winners-take-all.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Winner-take-all (computing)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.